A Noncommutative Ordinally Simple Linearly Ordered Group

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets

In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms. Bounds on the difference between the number of comparisons required by this algorithm and the information theory lower bounds are derived. Results from a computer implementation of the new algorithm are gi...

متن کامل

Linearly Compact Rings Having a Simple Group of Units

Those linearly compact rings with identity having a simple group of units and a transsnitely nilpotent Jacobson radical are identiied. A consequence of this characterization is Cohen and Koh's classiication theorem for compact rings with identity having a simple group of units.

متن کامل

Linearly Ordered Topological Spaces

This work is devoted to the study of certain cardinality modifications of paracompactness and compactness in the setting of linearly ordered spaces. Some of the concepts treated here have previously been studied by Aquaro [l]1, Gulden [4], Kennison [5], Mansfield [6], Morita [7], and Poppe [9]. On the other hand, the concept of m-boundedness, introduced in §2, is new. Our main results (Theorems...

متن کامل

Quasimartingales with a Linearly Ordered Index Set

We consider quasi-martingales indexed by a linearly order set. We show that such processes are isomorphic to a given class of (finitely additive) measures. From this result we easily derive the classical theorem of Stricker as well as the decompositions of Riesz, Rao and the supermartingale decomposition of Doob and Meyer.

متن کامل

Parsing Using Linearly Ordered Phonological Rules

A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing algorithm would face by encoding into the form being parsed the ambiguities which arise during parsing. The algorithm has been implemented and tested on real langua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1951

ISSN: 0002-9939

DOI: 10.2307/2031706